A Multi-Scale Singularity Bounding Volume Hierarchy
نویسندگان
چکیده
A scale space approach is taken for building Bounding Volume Hierarchies (BVHs) for collision detection. A spherical bounding volume is generated at each node of the BVH using estimates of the mass distribution. Traditional top-down methods approximates the surface of an object in a coarse to fine manner, by recursively increasing resolution by some factor, e.g. 2. The method presented in this article analyzes the mass distribution of a solid object using a well founded scale-space based on the Diffusion Equation: the Gaussian Scale-Space. In the Gaussian scale-space, the deep structure of extremal mass points is naturally binary, and the linking process is therefore simple. The main contribution of this article is a novel approach for constructing BVHs using Multi-Scale Singularity Trees (MSSTs) for collision detection. The BVH-building algorithm extends the field with a new method based on volumetric shape rather than statistics of the surface geometry or geometrical constructs such as medial surfaces.
منابع مشابه
A Parallel Collision Detection Algorithm Based on Hybrid Bounding Volume Hierarchy
* Supported by National Natural Science Foundation of China and Excellent Young Teacher Foundation of Education Ministry of China. Abstract One of the key problems with current interactive virtual environments is real-time collision detection. In this paper, a parallel algorithm for realtime, exact collision detection is presented. The approach adopts a hierarchical adaptive space subdivision s...
متن کاملA Three-layer Hybrid Bounding Volume Hierarchy for Collision Detection
The Real-time collision detection (CD) is an important problem in virtual environments. This paper proposes a novel algorithm called SBBK which combines three different kinds of bounding volumes (BVs) together when constructing the hybrid bounding box tree for the object to make CD more accurate and faster. For illustration, CD experiments are carried out to show its advantages. The experiment ...
متن کاملStrategies for Bounding Volume Hierarchy Updates for Ray Tracing of Deformable Models
In this paper, we describe strategies for bounding volume hierarchy updates for ray tracing of deformable models. By using pre-built hierarchy structures and a lazy evaluation technique for updating the bounding volumes, the hierarchy reconstruction can be made very efficiently. Experiments show that for deforming triangle meshes the reconstruction time of the bounding volume hierarchies per fr...
متن کاملRotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy
We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new c-rb-tree to two existing bounding-volumes hierarchies, namely c-dop-trees and box-trees.
متن کاملRay Tracing with the Single Slab Hierarchy
Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005